Method and Apparatus for Generating a Channel State Information Report

ABSTRACT

An apparatus and method provide for receiving, from a network node, a set of reference signals. A set of beams are identified based on the set of reference signals. A subset of coefficients with non-zero values are determined from a set of coefficients, each coefficient of the subset of coefficients being associated with a pair of values comprising an amplitude value and a phase value, each coefficient of the set of coefficients corresponding to a respective beam of the set of beams for each respective layer of the set of layers and a respective frequency-domain index of a set of frequency domain indices for each layer of the set of layers. The set of layers are partitioned into a plurality of groups of layers. A beam bitmap vector is generated for each group of the plurality of groups of layers, the beam bitmap vector indicating a subset of beams of the set of beams within the layer-group, the subset of beams being associated with the subset of coefficients. A coefficient bitmap vector is generated for each beam of the subset of beams for each group of the plurality of groups of layers, the coefficient bitmap vector indicating a respective frequency domain index associated with each of the subset of coefficients. A channel state information (CSI) report comprising the beam bitmap vector is transmitted to the network node for each group of the plurality of groups of layers, the coefficient bitmap vector for each beam of the subset of beams, or a plurality of pairs of coefficient values corresponding to the subset of coefficients, each pair of the plurality of pairs of coefficient values comprising a respective amplitude value and a respective phase value.

FIELD OF THE INVENTION

The present disclosure is directed to a method and apparatus related togenerating a channel state information report, including the generationof a channel state information report having information correspondingto a set of layers, where a beam bitmap vector for a group of layersindicates a subset of the selected set of beams for the group of layers.

BACKGROUND OF THE INVENTION

Presently, user equipment, such as wireless communication devices,communicate with other communication devices using wireless signals,such as within a network environment that can include one or more cellswithin which various communication connections with the network andother devices operating within the network can be supported. Networkenvironments often involve one or more sets of standards, which eachdefine various aspects of any communication connection being made whenusing the corresponding standard within the network environment.Examples of developing and/or existing standards include new radioaccess technology (NR), Long Term Evolution (LTE), Universal MobileTelecommunications Service (UMTS), Global System for MobileCommunication (GSM), and/or Enhanced Data GSM Environment (EDGE).

In an effort to enhance system performance, more recent standards havelooked at different forms of spatial diversity including different formsof multiple input multiple output (MIMO) systems, which involve the useof multiple antennas at each of the source and the destination of thewireless communication for multiplying the capacity of the radio linkthrough the use of multipath propagation. Such a system makesincreasingly possible the simultaneous transmission and reception ofmore than one data signal using the same radio channel.

As part of supporting MIMO communications, user equipment can make useof channel state information codebooks, which help to define the natureof the adopted beams, which are used to support a particular dataconnection. Higher rank codebooks can sometimes be used to enhancesystem performance, but often at the price of an increase in the amountof feedback overhead.

In at least some wireless communication systems, channel stateinformation (CSI) feedback is used to report on current channelconditions. This can be increasingly useful in frequency divisionduplexing (FDD) and frequency division multiple access (FDMA) systemswhere the downlink (DL) and uplink (UL) channels are not reciprocal.With multi-user (MU)-MIMO and spatial multiplexing, a receiving device,such as a user equipment (UE), may need to report channel conditions formultiple channels or beams. Accordingly, much overhead may be dedicatedto CSI reporting in MU-MIMO and spatial multiplexing systems.

The present inventors have recognized that improved methods forefficiently coding a channel state information report may be beneficial,as well as apparatuses and systems that perform the functions of themethods. The present inventors have further recognized that one suchmethod can include communicating with a network using spatialmultiplexing, which includes one or more base stations. Here, multipletransmission layers may be transmitted at a time, each transmissionlayer comprising multiple beams, which can be arranged into one or morelayer-groups. A beam bitmap vector for each layer-group can indicate asubset of the selected set of beams that have a coefficient bitmapvector included as part of a channel state information reporttransmitted to the network.

SUMMARY

The present application provides an apparatus for wirelesscommunication. The apparatus includes a processor and memory coupledwith the processor. The processor is configured to receive, from anetwork node, a set of reference signals. A set of beams are identifiedbased on the set of reference signals. A subset of coefficients withnon-zero values are determined from a set of coefficients, eachcoefficient of the subset of coefficients being associated with a pairof values comprising an amplitude value and a phase value, eachcoefficient of the set of coefficients corresponding to a respectivebeam of the set of beams for each respective layer of the set of layersand a respective frequency-domain index of a set of frequency domainindices for each layer of the set of layers. The set of layers arepartitioned into a plurality of groups of layers. A beam bitmap vectoris generated for each group of the plurality of groups of layers, thebeam bitmap vector indicating a subset of beams of the set of beamswithin the layer-group, the subset of beams being associated with thesubset of coefficients. A coefficient bitmap vector is generated foreach beam of the subset of beams for each group of the plurality ofgroups of layers, the coefficient bitmap vector indicating a respectivefrequency domain index associated with each of the subset ofcoefficients. A channel state information (CSI) report comprising thebeam bitmap vector is transmitted to the network node for each group ofthe plurality of groups of layers, the coefficient bitmap vector foreach beam of the subset of beams, or a plurality of pairs of coefficientvalues corresponding to the subset of coefficients, each pair of theplurality of pairs of coefficient values comprising a respectiveamplitude value and a respective phase value.

According to another possible embodiment, a method is provided. Themethod includes receiving, from a network node, a set of referencesignals. A set of beams are identified based on the set of referencesignals. A subset of coefficients with non-zero values are determinedfrom a set of coefficients, each coefficient of the subset ofcoefficients being associated with a pair of values comprising anamplitude value and a phase value, each coefficient of the set ofcoefficients corresponding to a respective beam of the set of beams foreach respective layer of the set of layers and a respectivefrequency-domain index of a set of frequency domain indices for eachlayer of the set of layers. The set of layers are partitioned into aplurality of groups of layers. A beam bitmap vector is generated foreach group of the plurality of groups of layers, the beam bitmap vectorindicating a subset of beams of the set of beams within the layer-group,the subset of beams being associated with the subset of coefficients. Acoefficient bitmap vector is generated for each beam of the subset ofbeams for each group of the plurality of groups of layers, thecoefficient bitmap vector indicating a respective frequency domain indexassociated with each of the subset of coefficients. A channel stateinformation (CSI) report comprising the beam bitmap vector istransmitted to the network node for each group of the plurality ofgroups of layers, the coefficient bitmap vector for each beam of thesubset of beams, or a plurality of pairs of coefficient valuescorresponding to the subset of coefficients, each pair of the pluralityof pairs of coefficient values comprising a respective amplitude valueand a respective phase value.

These and other features, and advantages of the present application areevident from the following description of one or more preferredembodiments, with reference to the accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

A more particular description of the embodiments briefly described abovewill be rendered by reference to specific embodiments that areillustrated in the appended drawings. Understanding that these drawingsdepict only some embodiments and are not therefore to be considered tobe limiting of scope, the embodiments will be described and explainedwith additional specificity and detail through the use of theaccompanying drawings, in which:

FIG. 1 is an example block diagram of a system according to a possibleembodiment;

FIG. 2 is an example of a bit map diagram of size 2L×M, where an ‘x’corresponds to the location of a non-zero coefficient for a given layer;

FIG. 3 is an example of a bit map diagram of size 2L, where an ‘x’indicates the location of a utilized beam for a given layer group;

FIGS. 4-6 are bit map diagrams identifying utilized beams for a pair oflayer-groups, as well as a composite bit map diagram representative ofmultiple layer-groups, which is formed using an exclusive-or operation,in accordance with a first example;

FIGS. 7-9 are bit map diagrams identifying utilized beams for a pair oflayer-groups, as well as a composite bit map diagram representative ofmultiple layer-groups, which is formed using an exclusive-or operation,in accordance with a second example;

FIGS. 10A and 10B are a table comparing multiple schemes for a casehaving arbitrary beams per layer group with fixed frequency domain basissize after frequency compression, across layer-groups;

FIG. 11 is a table comparing multiple schemes for a case havingarbitrary beams per layer group with an unequal frequency domain basissize after frequency compression, across layer-groups, where thefrequency domain basis size for layer-group 2 is less than (or equal)the frequency domain basis size for layer group 1;

FIG. 12 is a flow diagram in a user equipment for generating a channelstate information report having information corresponding to a set oflayers;

FIG. 13 is a flow diagram in a network for generating a channel stateinformation report having information corresponding to a set of layers;and

FIG. 14 is an example block diagram of an apparatus according to apossible embodiment.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT(S)

While the present disclosure is susceptible of embodiment in variousforms, there is shown in the drawings and will hereinafter be describedpresently preferred embodiments with the understanding that the presentdisclosure is to be considered an exemplification of the invention andis not intended to limit the invention to the specific embodimentsillustrated.

Embodiments provide a method and apparatus for generation of a channelstate information report, including the generation of a channel stateinformation report having information corresponding to a set of layers.

FIG. 1 is an example block diagram of a system 100 according to apossible embodiment. The system 100 can include a User Equipment (UE)110, at least one network entity 120 and 125, such as a base station,and a network 130. The UE 110 can be a wireless wide area networkdevice, a user device, wireless terminal, a portable wirelesscommunication device, a smartphone, a cellular telephone, a flip phone,a personal digital assistant, a personal computer, a selective callreceiver, an Internet of Things (IoT) device, a tablet computer, alaptop computer, or any other user device that is capable of sending andreceiving communication signals on a wireless network. The at least onenetwork entity 120 and 125 can be a wireless wide area network basestation, can be a NodeB, can be an enhanced NodeB (eNB), can be a NewRadio NodeB (gNB), such as a 5G NodeB, can be an unlicensed network basestation, can be an access point, can be a base station controller, canbe a network controller, can be a Transmission/Reception Point (TRP),can be a different type of network entity from each other, and/or can beany other network entity that can provide wireless access between a UEand a network.

The network 130 can include any type of network that is capable ofsending and receiving wireless communication signals. For example, thenetwork 130 can include a wireless communication network, a cellulartelephone network, a Time Division Multiple Access (TDMA)-based network,a Code Division Multiple Access (CDMA)-based network, an OrthogonalFrequency Division Multiple Access (OFDMA)-based network, a Long TermEvolution (LTE) network, a 3rd Generation Partnership Project(3GPP)-based network, a satellite communications network, a highaltitude platform network, the Internet, and/or other communicationsnetworks.

In operation, the UE 110 can communicate with the network 130 via atleast one network entity 120. For example, the UE can send and receivecontrol signals on a control channel and user data signals on a datachannel.

In 3GPP New Radio (NR) systems, Type-1 and Type-II codebook-basedchannel state information (CSI) feedback have been adopted to supportadvanced MIMO transmission. Both types of codebooks are constructed fromtwo-dimensional discrete Fourier transform (DFT)-based grid of beams andenable the CSI feedback of beam selection as well as phase shift keying(PSK) based co-phase combining between two polarizations. Type-Icodebooks are used for standard resolution CSI feedback, while Type-IIcodebooks are used for high resolution CSI feedback. As a result, it isenvisioned that more accurate CSI can be obtained from Type-IIcodebook-based CSI feedback so that enhanced precoded MIMO transmissioncan be employed by the network.

Type-II codebook was described to handle up to two MIMO layers pertransmission, given the large amount of CSI feedback overhead that isgenerally associated with each layer. Extending the Type-II codebookframework to include more than two layers could result in significantadditional overhead to handle transmission.

A number of techniques have been proposed to reduce the CSI feedbackoverhead of Type-II codebook for up to rank-2 transmission. Thesetechniques vary in nature from spatial compression, frequencycompression, as well as omitting coefficients with relatively smallamplitude.

Assuming the gNB is equipped with a two-dimensional (2D) antenna arraywith N₁, N₂ antenna ports per polarization placed horizontally andvertically and communication occurs over N₃ pre-coding matrix indicator(PMI) subbands, a PMI subband can include a set of resource blocks, eachresource block having a set of subcarriers. In order to reduce theuplink (UL) feedback overhead, a discrete Fourier transform (DFT)-basedCSI compression of the spatial domain is applied to L beams perpolarization, where L<N₁N₂. Similarly, additional compression in thefrequency domain is applied, where each beam of the frequency-domainprecoding vectors is transformed using an inverse DFT matrix to thedelay domain, and the magnitude and phase values of a subset of thedelay-domain coefficients are selected and fed back to the gNB as partof the CSI report. The 2N₁N₂×N₃ codebook per layer r takes on the form

W ^((r)) =W ₁ {tilde over (W)} ₂ ^((r)) W ₃ ^((r)H),

where W₁ is a 2N₁N₂×2L block-diagonal matrix (L<N₁N₂) with two identicaldiagonal blocks i.e.,

${W_{1} = \begin{bmatrix}B & 0 \\0 & B\end{bmatrix}},$

and B is an N₁N₂×L matrix with columns drawn from a 2D oversampled DFTmatrix, as follows.

${u_{m} = \ \begin{bmatrix}1 & e^{j\frac{2\pi m}{O_{2}N_{2}}} & \ldots & e^{j\frac{2\pi{m({N_{2} - 1})}}{O_{2}N_{2}}}\end{bmatrix}},{\nu_{l,m} = \begin{bmatrix}u_{m} & {e^{j\frac{2\pi l}{O_{1}N_{1}}}u_{m}} & \ldots & {e^{j\frac{2\pi{l({N_{1} - 1})}}{O_{1}N_{1}}}u_{m}}\end{bmatrix}^{T}},{B = \begin{bmatrix}v_{l_{0},m_{0}} & v_{l_{1},m_{1}} & \ldots & v_{l_{L - 1},m_{L - 1}}\end{bmatrix}},{l_{i} = {{O_{1}n_{1}^{(i)}} + q_{1}}},{0 \leq n_{1}^{(i)} < N_{1}},{0 \leq q_{1} < {O_{1} - 1}},{m_{i} = {{O_{2}n_{2}^{(i)}} + q_{2}}},{0 \leq n_{2}^{(i)} < N_{2}},{0 \leq q_{2} < {O_{2} - 1}},$

where the superscript T denotes a matrix transposition operation. Notethat O₁, O₂ oversampling factors are assumed for the 2D DFT matrix fromwhich matrix B is drawn. Note that W₁ is common across all layers. W_(f)is an N₃×M matrix (M<N₃) with columns selected from a critically-sampledsize-N₃ DFT matrix, as follows

${W_{f} = \begin{bmatrix}f_{k_{0}} & f_{k_{1}} & \ldots & f_{k_{M - 1}}\end{bmatrix}},{0 \leq k_{i} < {N_{3} - 1}},{f_{k} = {\begin{bmatrix}1 & e^{{- j}\frac{2\pi k}{N_{3}}} & \ldots & e^{{- j}\frac{2\pi{k({N_{3} - 1})}}{N_{3}}}\end{bmatrix}^{T}.}}$

Only the indices of the L selected columns of B are reported, along withthe oversampling index taking on O₁O₂ values. Similarly for W_(F), onlythe indices of the M selected columns out of the predefined size-N₃ DFTmatrix are reported. Hence, L, M represent the equivalent spatial andfrequency dimensions after compression, respectively. Finally, the 2L×Mmatrix {tilde over (W)}₂ ^((r)) represents the linear combinationcoefficients (LCCs) of the spatial and frequency DFT-basis vectors. Bothare {tilde over (W)}₂ ^((r)) and W₃ ^((r)) and independent for differentlayers. Magnitude and phase values of an approximately β fraction of the2LM available coefficients are reported to the gNB (β<1) as part of theCSI report, where coefficients with zero magnitude are indicated via aper-layer coefficients bitmap. Since all coefficients reported within alayer is normalized with respect to the coefficient with the largestmagnitude (strongest coefficient), the relative value of thatcoefficient is set to unity, and no magnitude or phase information isexplicitly reported for this coefficient. Only an indication of theindex of the strongest coefficient per layer is reported. Hence, for asingle-layer transmission, magnitude and phase values of a maximum of┌2βLM┌−1 coefficients (along with the indices of selected L, M DFTvectors) are reported per layer, which can lead to a meaningfulreduction in the CSI report size.

For a Type-II codebook, the UE reports the indices of the non-zerocoefficients per layer that characterize the precoder across twotransformed bases representing the spatial and frequency dimensions ofthe codebook. The non-zero coefficient indices are reported in the formof a two-dimensional bitmap of size 2L×M for each layer, where L, Mindicate the per-polarization spatial and frequency basis dimensionsafter compression, respectively. For dual-polarized antennas, a total of2L beams are indicated per layer. The number of non-zero coefficients tobe reported per layer (K₁) is parameterized by a higher-layer parameterβ, which satisfies K₁≤2LMβ, where β<1, i.e., the number of channelcoefficients being fed back to the gNB is a fraction of the totalcoefficients. This implies that the 2L×M bitmap can be a sparse matrix,with possibly one or more rows (beams) or columns (frequency units)being all zeros. Note that the bitmap size can be significant comparedwith the total overhead, e.g., for rank-4 transmission with typicalvalues of L=4, M=7, the bitmaps can contribute to up to 224 overheadbits.

One example for a case with L=4, M=7 is illustrated in FIGS. 2 and 3.FIG. 2 illustrates a size 2L×M bitmap, where x corresponds to non-zerocoefficient locations. This bitmap corresponds to a case whereK₀=┌β2LM=14 non-zero coefficients are reported at β=¼. Hence, there is apossibility that the bitmap matrix is sparse with many rows and/orcolumns that are unutilized.

If somehow we can report the indices of the unutilized beams, this wouldhelp further reduce the overhead. For example, we can introduce a newbitmap of size 2L that indicates the utilized beams as illustrated inFIG. 3.

In the case of the illustrated example, we can see that L′=5 bits acrossboth polarizations are utilized, and that the overhead of reporting thecoefficients' locations can drop from 2LM=56 bits to L′M+2L=43 bits, andhence 13 bits can be saved. For a Rank-4 transmission, an overall of 52bits can be reduced in overhead, where this approach involves no loss ofinformation.

In the sequel, the notion of layer-group is used, where a layer-grouprepresents a set of one or more beams. One possible setup is groupinglayers 1, 2 into one layer group (Layer Group 1) and layers 3, 4 intoanother layer group (Layer Group 2).

Cases where reducing the 2L×M bitmap size may be beneficial can includeinstances in which:

-   -   1. The number of non-zero coefficients (K₁) within a layer is        small compared with 2LM, especially at Rank R>2, i.e., many rows        will be all zeros with high probability. Hence, it would be more        efficient to have a smaller bitmap for each layer that includes        the utilized beams only.    -   2. Possible scenarios for Rank 3-4 transmission include        orthogonal beams across layers/layer-groups, or in a more        general setup partially overlapping beams, i.e., only a subset        of the beams is allowed to be reused across layers/layer-groups.        In such scenarios, multiple beams would be unutilized for a        layer/layer-group, and hence it makes sense to use a bitmap for        each layer that does not include these omitted beams.    -   3. One possible scenario for Rank 3-4 transmission is utilizing        the smallest subset of beams that comprise x % of the total WB        power of the channel, where x∈[0,100]. In such a case, a subset        of the beams is only utilized for each layer/layer-group and        hence it is more efficient to have a smaller bitmap for each        layer.

Feedback in Type-II CSI is being reported in two consecutive parts inthe uplink control information (UCI): UCI part 1 with typically a fixedsize, which is usually small and is used to report parameters thatindicate the size of the remainder of the feedback information, and UCIpart 2 with typically a variable size (parameterized by the content inUCI part 1). Hence, any parameter that would signal a potentialreduction in overhead size will generally need to be reported in UCIpart 1.

In accordance with the present application different embodiments thataim at reducing the overhead of each of the bitmaps for rank 3-4transmission via reporting auxiliary information that enables reducingthe coefficients bitmap overhead without loss of information areproposed. More specifically, three different schemes are proposed. Thefirst scheme aims at reducing the total overhead bits in the system. Thesecond scheme attempts to prioritize the reduction of the overheadincluded as part of UCI part 1, whereas the third scheme attempts a morebalanced approach between minimizing the UCI part 1 overhead and thetotal overhead corresponding to the bitmap information.

For ease of exposition, we discuss the proposed schemes for up to rank 4transmission, where beams are utilized in a layer-group manner, e.g.,layers 1, 2 utilize a common subset of spatial beams, whereas layers 3,4 can utilize a different subset of the beams, where both subsets arenot necessarily disjoint. Extension to the layer-based case, i.e., eachlayer is associated with its own subset of beams, is also covered.

Embodiment 1: Reporting a Beam Bitmap for Each Layer-Group in UCI Part 1

In this approach a bitmap of size 2L, which we name a beam bitmap, isreported for each layer group in UCI part 1, where a zero value in thei^(th) location of the beam bitmap indicates that all coefficient valuescorresponding to the i^(th) beam location are not reported for any ofthe layers within the layer group corresponding to this beam bitmap.Assuming that the two beam bitmaps have L_(G1), L_(G2) non-zerolocations, then layer groups 1, 2 utilize L_(G1)≤2L and L_(G2)≤2L beams,respectively, such as for rank 4 transmission, bitmaps of sizes L_(G1)M,L_(G1)M, L_(G2)M and L_(G2)M for layers 1 to 4, respectively, comparedwith a total of 8LM bits.

At least one advantage of this approach is that the two beam bitmapsprovide full information on the number of beams utilized for each layergroup (for proper allocation of UCI part-2 size) as well as the indicesof such beams (for proper mapping of beams). One potential drawback,however, is that all of the overhead (a total of 4L bits) will generallybe allocated in UCI part 1, which may be desired to be small.

This approach can be generalized to the layer-based case, wherein forthe case of R layers being reported, R beam bitmaps would be reported inUCI part 1.

Embodiment 2: Reporting the Total Number of Beams Utilized in UCI Part 1

In this approach only the total number of beams utilized across bothlayer groups is reported in UCI part 1. This number typically requires┌log₂q′_(L)┐ to be signaled, where q′_(L) represents the total number ofpossible values for the sum of beams utilized across layer groups, whichis sufficient to indicate the bitmap sizes to be included as part of UCIpart 2. In addition, two 2L bitmaps corresponding to the two layergroups would still be signaled in UCI part 2 to indicate the locationsof the utilized beams per layer group.

While this approach will often consume more overhead bits when comparedto the previous approach (┌log₂q′_(L) ┐ more bits), it will typicallyhave less UCI part 1 bits when compared to the prior embodiment, whichin some instances may be an important design criterion.

This approach can be generalized to the layer-based case with R layers,where q′_(L) would represent the total number of beams utilized acrosslayers, and R beam bitmaps of size 2L each would be reported in UCI part2.

Embodiment 3: Reporting One Beam Bitmap in UCI Part 1

In this approach, one bitmap that indicates the beam utilization isreported in UCI part 1. In the case of two layers/layer groups, abit-XOR of the beam bitmaps of layer group 1 and layer group 2, which wecall BP_(x), is reported. Note that beams that are shared by both layergroups will be indicated by zeros in BP_(x), whereas all other beams inthe XOR beam bitmap will be represented by ones. An upper bound on thetotal number of beams utilized can then be deduced from BP_(x), (2L+no.of zero entries in BP_(x)). The advantage of reporting BP_(x) in UCIpart 1 over directly reporting the total number of beams is that BP_(x)comprises information about both bitmaps of layer groups 1, and 2 (wecall them BP_(G1) and BP_(G2) in the sequel). BP_(G2) can be realizedgiven BP_(G1) and BP_(x), i.e., BP_(G2)=bit-XOR(BP_(G1), BP_(G2)).Hence, only BP_(G1) needs to be reported in UCI part 2.

More generally, this approach involves reporting a bitwise map BP_(x) ofsize 2L in UCI part 1 that comprises information on the total number ofbeams utilized across layer-groups, as well as information on thebitmaps for layers/layer-groups. Only R−1 bitmaps would then begenerally needed in UCI part 2 in the case of R layers/layer-groups.

Extension to the Case with Arbitrary Frequency Domain (FD) Basis Sizefor Each Layer/Layer-Group:

The aforementioned schemes in Embodiment 1 through Embodiment 3 can begeneralized to the case where the FD basis size for eachlayer/layer-group is not necessarily the same. No changes would benecessary for Scheme 1 other than reporting the FD basis size (ifrequired). Scheme 2 could involve reporting the number of beams in eachlayer/layer-group instead of the aggregate beams, in addition toreporting the FD basis size (if required). Scheme 3 could includereporting a possibly additional parameter representing the number ofbeams in one or more of the layers/layer groups, in addition toreporting the FD basis size (if required).

One approach for higher rank transmission utilizes a separate subset ofbeams for each layer/layer group, where these subsets are possiblydisjoint. If so, the bitmap reporting overhead can be meaningfullyreduced since some beams are unutilized for a given layer. So, it couldbe more efficient to indicate only the utilized beams and report asmaller bitmap per layer which includes information corresponding to theutilized beams, resulting in a reduction in CSI feedback overheadwithout any loss of information.

The following summarizes each of the three schemes, where a generalreporting format is as follows:

UCI-P1: No. of bits to be reported in UCI Part 1 to accommodate theproposed approachUCI-P2: No. of bits to be reported in UCI Part 2 to accommodate theproposed approachUCI-Total: No. of bits to be reported in both UCI Part 1 and UCI Part 2to accommodate the proposed approach.

Scheme 1:

The UCI overhead of Scheme 1 for reporting the utilized beams for twolayers/layer groups is as follows:UCI-Part 1: 4L bitsUCI-P2: 0 bitsUCI-Total: 4L bitsThe UCI overhead of Scheme 1 for reporting the utilized beams for R>2layers/layer groups is as follows:UCI-Part 1: 2LR bitsUCI-P2: 0 bitsUCI-Total: 2LR bits

Scheme 2:

The UCI overhead of Scheme 2 for reporting the utilized beams for twolayers/layer groups is as follows:UCI-P1: ┌log₂q′L┐ bitsUCI-P2: 4L bitsUCI-Total: ┌log₂q′L┐ bitsq′_(L) indicates number of all possible values for sum of beams acrosslayer groupsThe UCI overhead of Scheme 2 for reporting the utilized beams for Rlayers/layer groups is as follows:UCI-P1: ┌log₂q′_(L)┐ bitsUCI-P2: 2LR bitsUCI-Total: ┌log₂q′_(L)┐+2LR bitsq′_(L) indicates number of all possible values for sum of beams acrosslayers

Scheme 3:

Examples of the UCI overhead of Scheme 3 for reporting the utilizedbeams for two layers/layer groups

Report two beam bitmaps, BP_(x) and BP_(G1) (BP_(Gk) represents thebitmap for layer-group k) as follows:

-   -   i) BP_(x)=BITXOR(BP_(G1), BP_(G2)). This bitmap is transmitted        in UCI part 1. This bitmap provides locations of common beams        across layer groups+total number of beams across layers.    -   ii) Let q=nnz(BP_(x)), where nnz(s) is the number of non-zero        entries in a vector s. Then we know we need at most 2(2L+q)M        bits for coefficients bitmap, instead of 8LM bits, so thanks to        BP_(x) we can allocate an appropriate size of bitmaps for all        layers.    -   iii) In UCI part 2, another 2L bitmap (BP_(G1)) representing        location of utilized beams for layer group 1. Using BP_(x) and        BP_(G1), now we know the locations of utilized beams for all        layer groups, assuming that the 4 layers utilize all 2L beams.        If R≤2, this bitmap is not sent.

Example 1

FIGS. 4-6 illustrate bit map diagrams identifying utilized beams for apair of layer-groups, as well as a composite bit map diagramrepresentative of multiple layer-groups, which is formed using anexclusive-or operation, in accordance with a first example. Moreparticularly, FIG. 4 illustrates an example 400 of two potential beambitmaps.

In the particular example illustrated, we know from BP_(G1), BP_(G2)that L*=L_(G1)+L_(G2)=5+6=11.

-   -   1. Using BP_(x)=BITXOR(BP_(G1), BP_(G2)) we can obtain an upper        bound on the total number of beams used, and    -   2. Using BP_(x) and BP_(G1) we can obtain BP_(G2).

FIG. 5 illustrates BP_(x) based on the values for BP_(G1) and BP_(G2)illustrated in FIG. 4. The locations of ones in BP_(x) indicate thebeams utilized only in one layer group, whereas the locations of zerosin BP_(x) indicate the beams that were more likely utilized in bothlayer groups, but in some less likely instances may also correspond toinstances in which a beam was utilized in neither.

From BP_(x) we can deduce that L*≤2nz(BP_(x))+nnz(BP_(x))=2×3+5=11,where nz(s) is the number of zero entries in a vector s.

Now, as seen in FIG. 6, we can also determine BP_(G2)=XOR(BP_(x),BP_(G1)).

Example 2

The reason as to why we use the boldface expressions upper bound, morelikely as well as the inequality in the equation for L* above, iselaborated in the further example illustrated in FIGS. 7-9. Moreparticularly, FIG. 7 illustrates a different example 700 of twopotential beam bitmaps.

From BP_(G1), BP_(G2) we know that L*=L_(G1)+L_(G2)=5+5=10.

Next, we compute BP_(x) as illustrated in FIG. 8.

Given BP_(x) 2nz(BP_(x))+nz(BP_(x))=2×4+4=12 beams, hence we areassuming there are two more beams than there is in reality.

We can also determine BP_(G2) given BP_(G1) and BP_(x) as illustrated inFIG. 9.

In the previous example, two unutilized beams were considered activebecause beam 3 was not utilized by any beam group. This would requireslightly higher overhead. Nevertheless, BP_(G2) was perfectly recoveredwithout any errors.

The UCI overhead of Scheme 3 for reporting the utilized beams for twolayers/layer groups is as follows:UCI-Part 1: 2L bitsUCI-P2: 2L bitsUCI-Total: 4L bitsThe UCI overhead of Scheme 3 for reporting the utilized beams for Rlayers/layer groups is as followsUCI-Part 1: 2L. ┌log₂R┐ bitsUCI-P2: 2L(R−1) bitsUCI-Total: 2L. ┌log₂R┐+2L(R−1) bits

In this case, the entries of BP_(x) are each drawn from an alphabet ofsize R, i.e., {0, . . . , R−1}.

It may be well noted, that schemes 1-3 can further be modified in thefollowing manner. For example, one may use beam bitmaps of size L ratherthan 2L to report utilized beams, and hence the same beam across bothpolarizations could have the same utilized/unutilized status perlayer/laver-group.

Further, schemes 1-3 can be modified to the case where the FD basis size(M) is not the same across lavers/laver-groups. Details of the schemes,as well as overhead calculations, are provided in the sequel.

FIGS. 10 and 11 illustrate tables g a comparison between Schemes 1-3 forlayer-group-based cases.

Setup: Variable beam allocation for two layers/layer groups. M is fixed.Objective: Reduce total bitmap sizes to MΣL_(r), rather than 2LMR, whereL_(r)≤2L.

Case A: Arbitrary Beams Per Layer-Group, Fixed M.

More specifically, FIGS. 10A and 10B are a table 1000 comparing multipleschemes for a case having arbitrary beams per layer group with fixedfrequency domain basis size after frequency compression, acrosslayer-groups.

Summary for Case where M_(G1)=M_(G2). Layer-Group-Based Approach

Scheme 1:

UCI-P1: 4L bitsUCI-P2: 0 bitsUCI-Total: 4L bits

Scheme 2:

UCI-P1: ┌log₂q′_(L)┐ bitsUCI-P2: 4L bitsUCI-Total: ┌log₂q′_(L)┐+4L bitsq′_(L) indicates all possible values for L_(G1)+L_(G2).

-   -   If the values of L_(G1) and L_(G2) are arbitrary, q′_(L)=4L−1        (to indicate L_(G1)+L_(G2) varies from 2 to 4L)    -   If L_(G1)≤┌2La_(L1)┐ and L_(G2)≤┌2La_(L2)┐, e.g., Case 2, then        q′_(L)=┌2La_(L1)┐+┌2La_(L2)┐−1.

Scheme 3:

UCI-P1: 2L bitsUCI-P2: 2L bitsUCI-Total: 4L bitsCase B: M_(G2)≠M_(G1). Layer-Group-Based Approach

Assume M_(G2)=α_(M)M_(G1), where α_(M)∈{α_(M) ⁽¹⁾, α_(M) ⁽²⁾, . . . }and α_(M) is reported in UCI-P1. In that case ┌log₂|α_(M)|┐ extra bitsare needed in UCI-P1.

In this instance, you now may need to know both L_(G1) and L_(G2) fromUCI-P1 to set bitmaps L_(G1)×M_(G1) and L_(G2)×M_(G2) for layers 1, 2and 3, 4, respectively. Recall that L_(G1)+L_(G2) only was required whenM was fixed since we needed to allocate a total of 2(L_(G1)+L_(G2))Mbits for bitmaps.

Scheme 1: Two beam bitmaps of size 2L each are transmitted for eachlayer-group in UCI-P1, in addition to ┌log₂|α_(M)|┐ bits in UCI-P1 toIndicate the FD basis size for each layer-group. Total overhead ofUCI-P1 is ┌log₂|α_(M)|┐+4L bits, and no UCI-P2 bits are needed. TotalUCI bits is then ┌log₂|α_(M)|┐+4L bits.

FIG. 11 is a table 1100 comparing multiple schemes for a case havingarbitrary beams per layer group with an unequal frequency domain basissize after frequency compression, across layer-groups, where thefrequency domain basis size for layer-group 2 is less (or equal) thefrequency domain basis size for layer group 1.

Summary for Case where M_(G2)≤M_(G1).

Scheme 1:

UCI-P1: 4L+┌log₂|α_(M)┐ bitsUCI-P2: 0 bitsUCI-Total: 4L+┌log₂|α_(M)|┐ bits

Scheme 1 can be extended to the case where R>2 beam bitmaps of size 2Leach are transmitted in UCI-P1, along with the ┌log₂|α_(M)|┐ bits inUCI-P1 to indicate the FD basis size for each layer-group.

Scheme 2:

UCI-P1: ┌log₂q″_(L)┐+┌log₂|α_(M)|┐ bitsUCI-P2: 4L bitsUCI-Total: ┌log₂q″_(L)┐+┌log₂|α_(M)|┐+4L bitsq″_(L) indicates all possible values for the pair {L_(G1), L_(G2)}.

-   -   If L_(G1) and L_(G2) are arbitrary, q″_(L)=(2L)²    -   If L_(G1)≤2La_(L1) and L_(G2)≤2La_(L2) where α_(L1), α_(L2) are        fixed/higher-layer-configured, then        q″_(L)=┌2La_(L1)┐×┌2La_(L2)┐.

Scheme 2 can be extended to the case where R beam bitmaps of size 2Leach are transmitted in UCI-P2, and q″_(L), (signaled in UCI-P1) wouldindicate all possible values for the R-tuple {L₁, . . . , L_(R)}, alongwith the ┌log₂|α_(M)|┐ bits in UCI-P1 to indicate the FD basis size foreach layer-group.

Scheme 3:

UCI-P1: 2L+┌log₂q*_(L)┐+┌log₂|α_(M)┐ bitsUCI-P2: 2L bitsUCI-Total: ┌log₂q*_(L)┐+┌log₂|α_(M)|┐+4L bits q*_(L) indicates thenumber of possible values for either L_(G1) or L_(G2), whichever has asmaller size

-   -   If L_(G1) and L_(G2) are arbitrary, q*_(L)=2L    -   If L_(G1)≤2La_(L1) and L_(G2)≤2La_(L2) where α_(L1), α_(L2) are        fixed/higher-layer-configured, then q*_(L)=min(┌2La_(L1)┐,        ┌2La_(L2)┐).

Scheme 3 can be extended to the case with R>2, where R−1 beam bitmaps ofsize 2L each are transmitted in UCI-P2, and q*_(L) (signaled in UCI-P1)would indicate all possible values for the (R−1)-tuple {L₁, . . . ,L_(R-1)}, and the size-2L map BP_(x) (whose entries are drawn from analphabet of size R, and hence 2L. ┌log₂R┐ bits are needed to reportBP_(x)), along with the ┌log₂|α_(M)|┐ bits in UCI-P1 to indicate the FDbasis size for each layer-group.

Note that q*_(L)≤q″_(L) for all cases.

FIG. 12 illustrates a flow diagram 1200 in a user equipment forgenerating a channel state information report having informationcorresponding to a set of layers. The method includes receiving 1202 aset of reference signals transmitted from a network including at leastone base station. A set of beams are identified 1204 based on the set ofreference signals. A pair of amplitude and phase coefficient vectors areobtained 1206 by transforming the received set of reference signals,wherein each pair of the amplitude and phase coefficient vectorscorresponds to a beam in the set of beams in each layer of the set oflayers. The layers from the set of layers are partitioned 1208 into aset of layer-groups. A beam bitmap vector is generated 1210 for eachlayer-group indicating a subset of a selected set of beams within thelayer-group. A coefficient bitmap vector is generated 1212 for each ofthe selected set of beams in each layer indicating the coefficients withnon-zero amplitude values, based on the beam bit map vector. The channelstate information report is transmitted 1214 to the network, the channelstate information report comprising at least the beam bitmap vector andthe coefficient bitmap vector.

In some instances, the beam bitmap vector for each layer group canindicate the beams selected by at least one of the layers within thelayer-group.

In some instances, the channel state information report can bepartitioned into at least two parts. In some of these instances, thebeam bitmap vector for each layer group can be reported in a preselectedpart of the at least two parts of the channel state information report,whereas the coefficient bitmap vector for each layer is reported in apart of the channel state information report, which is subsequent to thepreselected part.

In other of these instances, an indication of a sum of cardinalities ofthe subset of the selected set of beams across layer-groups can bereported in a preselected part of the at least two parts of the channelstate information report, whereas the beam bitmap vector correspondingto each layer-group as well as the coefficient bitmap vectorcorresponding to each layer are reported in a part of the channel stateinformation report, which is subsequent to the preselected part.Further, the indication of a sum of cardinalities reported in thepreselected part of the at least two parts of the channel stateinformation report can represent a composite value of the sum ofselected beams for each layer-group.

In still other of these instances, an entry in the beam bitmap vectorcan have a particular binary value if the corresponding beam belongs tothe beam subset vector, whereas an entry in the beam bitmap vector has acomplement binary value, which is a complement of the particular binaryvalue, if the corresponding beam does not belong to the beam subsetvector. Further, an element-wise function of the beam bitmap vectors fortwo or more layer groups can be reported in a preselected part of the atleast two parts of the channel state information report, whereas thecoefficient bitmap vector for each layer and beam bitmap vectors arereported in a part of the channel state information report, which issubsequent to the preselected part. An additional indicator can bereported in the preselected part of the at least two parts of thechannel state information report that reflects the sum of the selectedbeams for each of a subset of the layer-groups, which includes less thanall of the layer-groups.

In some instances, the length of a beam bitmap vector for eachlayer-group is the number of selected beams in each polarization.

FIG. 13 illustrates a flow diagram 1300 in a network associated withreceiving a channel state information report having informationcorresponding to a set of layers. The method includes transmitting 1302a set of reference signals transmitted to the user equipment. A set ofbeams are identified 1304 based on the set of reference signals. A pairof amplitude and phase coefficient vectors are obtained 1306 bytransforming the received set of reference signals, where each pair ofthe amplitude and phase coefficient vectors corresponds to a beam in theset of beams in each layer of the set of layers. The layers from the setof layers are partitioned 1308 into a set of layer-groups. A beam bitmapvector is generated 1310 for each layer-group indicating a subset of aselected set of beams within the layer-group. A coefficient bitmapvector is generated 1312 for each of the selected set of beams in eachlayer indicating the coefficients with non-zero amplitude values, basedon the beam bit map vector. The channel state information report isreceived 1314 from the user equipment, the channel state informationreport including at least the beam bitmap vector and the coefficientbitmap vector.

It should be understood that, notwithstanding the particular steps asshown in the figures, a variety of additional or different steps can beperformed depending upon the embodiment, and one or more of theparticular steps can be rearranged, repeated or eliminated entirelydepending upon the embodiment. Also, some of the steps performed can berepeated on an ongoing or continuous basis simultaneously while othersteps are performed. Furthermore, different steps can be performed bydifferent elements or in a single element of the disclosed embodiments.

FIG. 14 is an example block diagram of an apparatus 1400, such as the UE110, the network entity 120, or any other wireless communication devicedisclosed herein, according to a possible embodiment. The apparatus 1400can include a housing 1410, a controller 1420 coupled to the housing1410, audio input and output circuitry 1430 coupled to the controller1420, a display 1440 coupled to the controller 1420, a memory 1450coupled to the controller 1420, a user interface 1460 coupled to thecontroller 1420, a transceiver 1470 coupled to the controller 1420, atleast one antenna 1475 coupled to the transceiver 1470, and a networkinterface 1480 coupled to the controller 1420. The apparatus 1400 maynot necessarily include all of the illustrated elements and/or mayinclude additional elements for different embodiments of the presentdisclosure. The apparatus 1400 can perform the methods described in allthe embodiments.

The display 1440 can be a viewfinder, a Liquid Crystal Display (LCD), aLight Emitting Diode (LED) display, an Organic Light Emitting Diode(OLED) display, a plasma display, a projection display, a touch screen,or any other device that displays information. The transceiver 1470 canbe one or more transceivers that can include a transmitter and/or areceiver. The audio input and output circuitry 1430 can include amicrophone, a speaker, a transducer, or any other audio input and outputcircuitry. The user interface 1460 can include a keypad, a keyboard,buttons, a touch pad, a joystick, a touch screen display, anotheradditional display, or any other device useful for providing aninterface between a user and an electronic device. The network interface1480 can be a Universal Serial Bus (USB) port, an Ethernet port, aninfrared transmitter/receiver, an IEEE 1394 port, a wirelesstransceiver, a WLAN transceiver, or any other interface that can connectan apparatus to a network, device, and/or computer and that can transmitand receive data communication signals. The memory 1450 can include aRandom Access Memory (RAM), a Read Only Memory (ROM), an optical memory,a solid state memory, a flash memory, a removable memory, a hard drive,a cache, or any other memory that can be coupled to an apparatus.

The apparatus 1400 or the controller 1420 may implement any operatingsystem, such as Microsoft Windows®, UNIX®, LINUX®, Android™, or anyother operating system. Apparatus operation software may be written inany programming language, such as C, C++, Java, or Visual Basic, forexample. Apparatus software may also run on an application framework,such as, for example, a Java® framework, a .NET® framework, or any otherapplication framework. The software and/or the operating system may bestored in the memory 1450, elsewhere on the apparatus 1400, in cloudstorage, and/or anywhere else that can store software and/or anoperating system. The apparatus 1400 or the controller 1420 may also usehardware to implement disclosed operations. For example, the controller1420 may be any programmable processor. Furthermore, the controller 1420may perform some or all of the disclosed operations. For example, someoperations can be performed using cloud computing and the controller1420 may perform other operations. Disclosed embodiments may also beimplemented on a general-purpose or a special purpose computer, aprogrammed microprocessor or microprocessor, peripheral integratedcircuit elements, an application-specific integrated circuit or otherintegrated circuits, hardware/electronic logic circuits, such as adiscrete element circuit, a programmable logic device, such as aprogrammable logic array, field programmable gate-array, or the like. Ingeneral, the controller 1420 may be any controller or processor deviceor devices capable of operating an apparatus and implementing thedisclosed embodiments. Some or all of the additional elements of theapparatus 1400 can also perform some or all of the operations of thedisclosed embodiments. At least some embodiments can provide a methodand apparatus for generating a channel state information report havinginformation corresponding to a set of layers.

At least some methods of this disclosure can be implemented on aprogrammed processor. However, the controllers, flowcharts, and/ormodules may also be implemented on a general purpose or special purposecomputer, a programmed microprocessor or microcontroller and peripheralintegrated circuit elements, an integrated circuit, a hardwareelectronic or logic circuit such as a discrete element circuit, aprogrammable logic device, or the like. In general, any device on whichresides a finite state machine capable of implementing the flowchartsshown in the figures may be used to implement the processor functions ofthis disclosure.

At least some embodiments can improve operation of the discloseddevices. Also, while this disclosure has been described with specificembodiments thereof, it is evident that many alternatives,modifications, and variations will be apparent to those skilled in theart. For example, various components of the embodiments may beinterchanged, added, or substituted in the other embodiments. Also, allof the elements of each figure are not necessary for operation of thedisclosed embodiments. For example, one of ordinary skill in the art ofthe disclosed embodiments would be enabled to make and use the teachingsof the disclosure by simply employing the elements of the independentclaims. Accordingly, embodiments of the disclosure as set forth hereinare intended to be illustrative, not limiting. Various changes may bemade without departing from the spirit and scope of the disclosure.

In this document, relational terms such as “first,” “second,” and thelike may be used solely to distinguish one entity or action from anotherentity or action without necessarily requiring or implying any actualsuch relationship or order between such entities or actions. The phrase“at least one of,” “at least one selected from the group of” or “atleast one selected from” followed by a list is defined to mean one,some, or all, but not necessarily all of, the elements in the list. Theterms “comprises,” “comprising,” “including,” or any other variationthereof, are intended to cover a non-exclusive inclusion, such that aprocess, method, article, or apparatus that comprises a list of elementsdoes not include only those elements but may include other elements notexpressly listed or inherent to such process, method, article, orapparatus. An element proceeded by “a,” “an,” or the like does not,without more constraints, preclude the existence of additional identicalelements in the process, method, article, or apparatus that comprisesthe element. Also, the term “another” is defined as at least a second ormore. The terms “including,” “having,” and the like, as used herein, aredefined as “comprising.” Furthermore, the background section is writtenas the inventor's own understanding of the context of some embodimentsat the time of filing and includes the inventor's own recognition of anyproblems with existing technologies and/or problems experienced in theinventor's own work.

What is claimed is:
 1. An apparatus for wireless communication,comprising: a processor; and memory coupled with the processor, theprocessor configured to: receive, from a network node, a set ofreference signals; identify a set of beams based on the set of referencesignals; determine a subset of coefficients with non-zero values from aset of coefficients, each coefficient of the subset of coefficientsbeing associated with a pair of values comprising an amplitude value anda phase value, each coefficient of the set of coefficients correspondingto a respective beam of the set of beams for each respective layer ofthe set of layers and a respective frequency-domain index of a set offrequency domain indices for each layer of the set of layers; partitionthe set of layers into a plurality of groups of layers; generate a beambitmap vector for each group of the plurality of groups of layers, thebeam bitmap vector indicating a subset of beams of the set of beamswithin the layer-group, the subset of beams being associated with thesubset of coefficients; generate a coefficient bitmap vector for eachbeam of the subset of beams for each group of the plurality of groups oflayers, the coefficient bitmap vector indicating a respective frequencydomain index associated with each of the subset of coefficients; andtransmit, to the network node, a channel state information (CSI) reportcomprising the beam bitmap vector for each group of the plurality ofgroups of layers, the coefficient bitmap vector for each beam of thesubset of beams, or a plurality of pairs of coefficient valuescorresponding to the subset of coefficients, each pair of the pluralityof pairs of coefficient values comprising a respective amplitude valueand a respective phase value.
 2. The apparatus of claim 1, wherein thebeam bitmap vector for each group of the plurality of groups of layersindicates a respective beam selected by a respective layer of arespective group of layers of the plurality of groups of layers.
 3. Theapparatus of claim 1, wherein the processor is further configured topartition the CSI report into at least two CSI parts.
 4. The apparatusof claim 3, wherein the beam bitmap vector for each group of theplurality of groups of layers is reported in a first CSI part of the atleast two CSI parts, and wherein the coefficient bitmap vector isreported in a second CSI part of the at least two CSI parts.
 5. Theapparatus of claim 3, wherein an indication of an aggregate size of thesubset of beams associated with the plurality of groups of layers isreported in a first CSI part of the at least two CSI parts, and whereinthe beam bitmap vector and the coefficient bitmap vector are reported ina second CSI part of the at least two CSI parts.
 6. The apparatus ofclaim 5, wherein an additional indicator is reported in the first CSIpart of the at least two CSI parts that indicates the aggregate size ofthe subset of beams associated with the plurality of groups of layers.7. The apparatus of claim 3, wherein an entry of the beam bitmap vectorcomprises a binary value corresponding to at least one beam included inthe subset of beams of the set of beams.
 8. The apparatus of claim 3,wherein an entry of the beam bitmap vector comprises a complementaryvalue of a binary value corresponding to at least one beam excluded fromthe subset of beams and included in the set of beams.
 9. The apparatusof claim 3, wherein an element-wise function of the beam bitmap vectorsfor two or more groups of the plurality of groups of layers is reportedin a first CSI part of the at least two CSI parts, and wherein the beambitmap vector and the coefficient bitmap vector are reported in a secondCSI part of the at least two CSI parts.
 10. The apparatus of claim 1,wherein a length of the beam bitmap vector for each group of theplurality of groups of layers corresponds to a number of beams of thesubset of beams.
 11. A method for wireless communication at a userequipment (UE), comprising: receiving, from a network node, a set ofreference signals; identifying a set of beams based on the set ofreference signals; determining a subset of coefficients with non-zerovalues from a set of coefficients, each coefficient of the subset ofcoefficients being associated with a pair of values comprising anamplitude value and a phase value, each coefficient of the set ofcoefficients corresponding to a respective beam of the set of beams foreach respective layer of the set of layers and a respectivefrequency-domain index of a set of frequency domain indices for eachlayer of the set of layers; partitioning the set of layers into aplurality of groups of layers; generating a beam bitmap vector for eachgroup of the plurality of groups of layers, the beam bitmap vectorindicating a subset of beams of the set of beams within the layer-group,the subset of beams being associated with the subset of coefficients;generating a coefficient bitmap vector for each beam of the subset ofbeams for each group of the plurality of groups of layers, thecoefficient bitmap vector indicating a respective frequency domain indexassociated with each of the subset of coefficients; and transmitting, tothe network node, a channel state information (CSI) report comprisingthe beam bitmap vector for each group of the plurality of groups oflayers, the coefficient bitmap vector for each beam of the subset ofbeams, or a plurality of pairs of coefficient values corresponding tothe subset of coefficients, each pair of the plurality of pairs ofcoefficient values comprising a respective amplitude value and arespective phase value.
 12. The method of claim 11, wherein the beambitmap vector for each group of the plurality of groups of layersindicates a respective beam selected by a respective layer of arespective group of layers of the plurality of groups of layers.
 13. Themethod of claim 11, further comprising partitioning the CSI report intoat least two CSI parts.
 14. The method of claim 13, wherein the beambitmap vector for each group of the plurality of groups of layers isreported in a first CSI part of the at least two CSI parts, and whereinthe coefficient bitmap vector is reported in a second CSI part of the atleast two CSI parts.
 15. The method of claim 13, wherein an indicationof an aggregate size of the subset of beams associated with theplurality of groups of layers is reported in a first CSI part of the atleast two CSI parts, and wherein the beam bitmap vector and thecoefficient bitmap vector are reported in a second CSI part of the atleast two CSI parts.
 16. The method of claim 15, wherein an additionalindicator is reported in the first CSI part of the at least two CSIparts that indicates the aggregate size of the subset of beamsassociated with the plurality of groups of layers.
 17. The method ofclaim 13, wherein an entry of the beam bitmap vector comprises a binaryvalue corresponding to at least one beam included in the subset of beamsof the set of beams.
 18. The method of claim 13, wherein an entry of thebeam bitmap vector comprises a complementary value of a binary valuecorresponding to at least one beam excluded from the subset of beams andincluded in the set of beams.
 19. The method of claim 13, wherein anelement-wise function of the beam bitmap vectors for two or more groupsof the plurality of groups of layers is reported in a first CSI part ofthe at least two CSI parts, and wherein the beam bitmap vector and thecoefficient bitmap vector are reported in a second CSI part of the atleast two CSI parts.
 20. The method of claim 11, wherein a length of thebeam bitmap vector for each group of the plurality of groups of layerscorresponds to a number of beams of the subset of beams.